OptSmart: a space efficient Optimistic concurrent execution of Smart contracts

نویسندگان

چکیده

Popular blockchains such as Ethereum and several others execute complex transactions in the block through user-defined scripts known smart contracts. Serial execution of contract transactions/atomic units (AUs) fails to harness multiprocessing power offered by prevalence multi-core processors. By adding concurrency AUs, we can achieve better efficiency higher throughput. In this paper, develop a concurrent miner that proposes executing AUs concurrently using optimistic Software Transactional Memory systems (STMs). It efficiently captures independent bin dependent graph (BG). Later, propose validator re-executes same deterministically followed BG given verify block. We rigorously prove correctness AUs. The performance benchmark shows average speedup for optimized is $$5.21 \times$$ , while maximum $$14.96 over serial miner. obtains an $$8.61 $$14.65 validator. proposed outperforms $$1.02 $$1.18\times$$ $$1 $$4.46 state-of-the-art miners validators, respectively. Moreover, efficient saves $$2.29 more space when compared with state-of-the-art.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Concurrent Perspective on Smart Contracts

In this paper, we explore remarkable similarities between multi-transactional behaviors of smart contracts in cryptocurrencies such as Ethereum and classical problems of shared-memory concurrency. We examine two real-world examples from the Ethereum blockchain and analyzing how they are vulnerable to bugs that are closely reminiscent to those that often occur in traditional concurrent programs....

متن کامل

Space-Efficient Latent Contracts

Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program’s asymptotic complexity; space-efficiency restores tail recursion and bounds the amount of space used by contracts. Space-efficient contract monitoring for contracts enforcing simple type disciplines (a/k/a gradual typing) is well studied. Prior work establishes a space-efficient s...

متن کامل

Optimistic Concurrent Zero Knowledge

We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is expected to require only a small constant number of rounds in practice. To prove that our protocol is secure, we identify a weak property of concurrent schedules—called footer-freeness—that suffices for efficient simulat...

متن کامل

Efficient Testing of Concurrent Programs with Abstraction-Guided Symbolic Execution

ion-Guided Symbolic Execution Neha Rungta, Eric G Mercer and Willem Visser∗ Dept. of Computer Science, Brigham Young University, Provo, UT 84602, USA ∗SEVEN Networks, 901 Marshall Street, Redwood City, CA 94063, USA Abstract. Exhaustive search techniques such as model checking and Exhaustive search techniques such as model checking and symbolic execution are insufficient to detect errors in con...

متن کامل

Optimistic Distributed Execution of Business Process Models

For the modeling of large and complex systems of business processes, a ow oriented, graphical modeling framework based on Petri nets has emerged, taping the potentials of a qualitative and a quantitative analysis based on one and the same model. For the quantitative analysis of business process models (BPMs) representing realistically sized enterprise organizations, traditional evaluation techn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Distributed and Parallel Databases

سال: 2022

ISSN: ['0926-8782', '1573-7578']

DOI: https://doi.org/10.1007/s10619-022-07412-y